A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem
نویسندگان
چکیده
منابع مشابه
A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem
1Pontificia Universidad Católica de Valparaı́so, 2362807 Valparaı́so, Chile 2Universidad San Sebastián, 8420524 Santiago, Chile 3Universidad Central de Chile, 8370178 Santiago, Chile 4Universidad Autónoma de Chile, 7500138 Santiago, Chile 5Universidad Cientifica del Sur, Lima 18 Lima, Peru 6Universidad de Playa Ancha, 2360003 Valparaı́so, Chile 7Escuela de Ingenieŕıa Industrial, Universidad Diego ...
متن کاملSolving Biobjective Set Covering Problem Using Binary Cat Swarm Optimization Algorithm
The set cover problem is a classical question in combinatorics, computer science and complexity theory. It is one of Karp’s 21 NP-complete problems shown to be NP-complete in 1972. Several algorithms have been proposed to solve this problem, based on genetic algorithms (GA), Particle Swarm Optimizer (PSO) and in recent years algorithms based in behavior algorithms based groups or herds of anima...
متن کاملA GRASP algorithm to solve the unicost set covering problem
The set covering problem (SCP) is a wellknown combinatorial optimization problem. We present a GRASP algorithm to Unicost Set Covering Problem, a special case of the Set Covering Problem where no distinction is made between covering sets. The most significant contribution of the algorithm is the incorporation of a local improvement procedure based on the heuristics to solve satisfiability probl...
متن کاملLocal Search Algorithm for Unicost Set Covering Problem
The unicost set covering problem is a NP-hard and it has many applications. In this paper we propose a new algorithm based on local search for solving the unicost set covering problem. A fitness function is proposed for this problem and different neighborhood relations are considered for the exploration of the neighborhood of the current solution. A new approach is introduced for effective expl...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/578541